Random Generalized Functions of Locally Finite Order
نویسندگان
چکیده
منابع مشابه
Generalized Higher Order Spt-functions
We give a new generalization of the spt-function of G.E. Andrews, namely Sptj(n), and give its combinatorial interpretation in terms of successive lower-Durfee squares. We then generalize the higher order spt-function sptk(n), due to F.G. Garvan, to jsptk(n), thus providing a two-fold generalization of spt(n), and give its combinatorial interpretation.
متن کاملCanonical formulas via locally finite reducts and generalized dualities
Axiomatizability, the finite model property (FMP), and decidability are some of the most frequently studied properties of non-classical logics. One of the first general methods of axiomatizing large classes of superintuitionistic logics (si-logics for short) was developed by Jankov [8]. For each finite subdirectly irreducible Heyting algebra A, Jankov designed a formula that encodes the structu...
متن کاملLocally Finite Simple Weight Modules over Twisted Generalized Weyl Algebras
We present methods and explicit formulas for describing simple weight modules over twisted generalized Weyl algebras. When a certain commutative subalgebra is finitely generated over an algebraically closed field we obtain a classification of a class of locally finite simple weight modules as those induced from simple modules over a subalgebra isomorphic to a tensor product of noncommutative to...
متن کاملFunctions of finite simplicial complexes that are not locally determined
The Euler characteristic, thought of as a function that assigns a numerical value to every finite simplicial complex, is locally determined in both a combinatorial sense and a geometric sense. In this note we show that not every function that assigns a numerical value to every finite simplicial complex via a linear combination of the numbers of simplices in each dimension is locally determined ...
متن کاملOrder monotonic solutions for generalized characteristic functions
Generalized characteristic functions extend characteristic functions of ‘classical’ TU-games by assigning a real number to every ordered coalition being a permutation of any subset of the player set. Such generalized characteristic functions can be applied when the earnings or costs of cooperation among a set of players depends on the order in which the players enter a coalition. In the literat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1968
ISSN: 0002-9939
DOI: 10.2307/2036233